A note on the generalized Hamming weights of Reed-Muller codes

In this note, we give a very simple description of the generalized Hamming weights of Reed--Muller codes. For this purpose, we generalize the well-known Macaulay representation of a nonnegative integer and state some of its basic properties.Comment: 8 page

Explicit MDS Codes with Complementary Duals

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on. LCD codes have been extensively studied in literature. On the other hand, MDS codes form an optimal family of classical codes which have wide applications in both theory and practice. The main purpose of this paper is to give an explicit construction of several classes of LCD MDS codes, using tools from algebraic function fields. We exemplify this construction and obtain several classes of explicit LCD MDS codes for the odd characteristic case

On the Deuring Polynomial for Drinfeld Modules in Legendre Form

We study a family $\psi^{\lambda}$ of $\mathbb F_q[T]$-Drinfeld modules, which is a natural analog of Legendre elliptic curves. We then find a surprising recurrence giving the corresponding Deuring polynomial $H_{p(T)}(\lambda)$ characterising supersingular Legendre Drinfeld modules $\psi^{\lambda}$ in characteristic $p(T)$.Comment: This article supersedes arXiv:1110.607

A new family of maximal curves

In this article we construct for any prime power $q$ and odd $n \ge 5$, a new $\mathbb{F}_{q^{2n}}$-maximal curve $\mathcal X_n$. Like the Garcia--G\" uneri--Stichtenoth maximal curves, our curves generalize the Giulietti--Korchm\'aros maximal curve, though in a different way. We compute the full automorphism group of $\mathcal X_n$, yielding that it has precisely $q(q^2-1)(q^n+1)$ automorphisms. Further, we show that unless $q=2$, the curve $\mathcal{X}_n$ is not a Galois subcover of the Hermitian curve. Finally, we find new values of the genus spectrum of $\mathbb{F}_{q^{2n}}$-maximal curves, by considering some Galois subcovers of $\mathcal X_n$

Maximum number of points on intersection of a cubic surface and a non-degenerate Hermitian surface

In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in \PP^3(\Fqt). The conjecture was proven to be true by Edoukou in the case when $d=2$. In this paper, we prove that the conjecture is true for $d=3$ and $q \ge 8$. We further determine the second highest number of rational points on the intersection of a cubic surface and a non-degenerate Hermitian surface. Finally, we classify all the cubic surfaces that admit the highest and second highest number of points in common with a non-degenerate Hermitian surface. This classifications disproves one of the conjectures proposed by Edoukou, Ling and Xing

Generalized Hamming weights of affine cartesian codes

In this article, we give the answer to the following question: Given a field $\mathbb{F}$, finite subsets $A_1,\dots,A_m$ of $\mathbb{F}$, and $r$ linearly independent polynomials $f_1,\dots,f_r \in \mathbb{F}[x_1,\dots,x_m]$ of total degree at most $d$. What is the maximal number of common zeros $f_1,\dots,f_r$ can have in $A_1 \times \cdots \times A_m$? For $\mathbb{F}=\mathbb{F}_q$, the finite field with $q$ elements, answering this question is equivalent to determining the generalized Hamming weights of the so-called affine Cartesian codes. Seen in this light, our work is a generalization of the work of Heijnen--Pellikaan for Reed--Muller codes to the significantly larger class of affine Cartesian codes.Comment: 12 Page

Weierstrass semigroups on the Giulietti-Korchm\'aros curve

In this article we explicitly determine the structure of the Weierstrass semigroups $H(P)$ for any point $P$ of the Giulietti-Korchm\'aros curve $\mathcal{X}$. We show that as the point varies, exactly three possibilities arise: One for the $\mathbb{F}_{q^2}$-rational points (already known in the literature), one for the $\mathbb{F}_{q^6} \setminus \mathbb{F}_{q^2}$-rational points, and one for all remaining points. As a result, we prove a conjecture concerning the structure of $H(P)$ in case $P$ is an $\mathbb{F}_{q^6} \setminus \mathbb{F}_{q^2}$-rational point. As a corollary we also obtain that the set of Weierstrass points of $\mathcal{X}$ is exactly its set of $\mathbb{F}_{q^6}$-rational points

Sub-quadratic Decoding of One-point Hermitian Codes

We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realisation of the Guruswami-Sudan algorithm by using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimisation. The second is a Power decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the same methods from computer algebra, yielding similar asymptotic complexities.Comment: New version includes simulation results, improves some complexity results, as well as a number of reviewer corrections. 20 page